Minutiae Based Geometric Hashing for Fingerprint Database

This paper proposes an efficient indexing technique for fingerprint database using minutiae based geometric hashing. A fixed length feature vector built from each minutia, known as Minutia Binary Pattern, has been suggested for the accurate match at the time of searching. Unlike existing geometric based indexing techniques, the proposed technique inserts each minutia along with the feature vector exactly once into a hash table. As a result, it reduces both computational and memory costs. Since minutiae of all fingerprint images in the database are found to be well distributed into the hash table, no rehashing is required. Experiments over FVC 2004 datasets prove the superiority of the proposed indexing technique against well known geometric based indexing techniques using fingerprints.